Deduction Graphs with Universal Quantification
نویسندگان
چکیده
منابع مشابه
Automated Deduction with Shannon Graphs
Binary Decision Diagrams (BDDs) are a well-known tool for representing Boolean functions. We show how BDDs can be extended to full rst-order logic by integrating means for representing quantiiers. The resulting structures are called Shannon graphs. A calculus based on these Shannon graphs is set up, and its soundness and completeness proofs are outlined. A comparison of deduction with rst-order...
متن کاملUniversal Graphs (with Forbidden Subgraphs)
The graph theoretic problem of identifying the finite sets C of constraint graphs for which there is a countable universal C-free graph is closely related to the problem of determining for which sets C the model companion T ∗ C of the theory of C-free graphs is א0-categorical, and this leads back to combinatorics. Little is known about these theories from any other perspective, such as stabilit...
متن کاملA Congruence Rule Format with Universal Quantification
We investigate the addition of universal quantification to the meta-theory of Structural Operational Semantics (SOS). We study the syntax and semantics of SOS rules extended with universal quantification and propose a congruence rule format for strong bisimilarity that supports this new feature.
متن کاملInduced-Universal Graphs for Graphs with Bounded Maximum Degree
For a family F of graphs, a graph U is induced-universal for F if every graph in F is an induced subgraph of U . We give a construction for an induceduniversal graph for the family of graphs on n vertices with degree at most r, which has Cnb(r+1)/2c vertices and Dn2b(r+1)/2c−1 edges, where C and D are constants depending only on r. This construction is nearly optimal when r is even in that such...
متن کاملNear-optimum Universal Graphs for Graphs with Bounded Degrees
Let H be a family of graphs. We say that G is H-universal if, for each H ∈ H, the graph G contains a subgraph isomorphic to H. Let H(k, n) denote the family of graphs on n vertices with maximum degree at most k. For each fixed k and each n sufficiently large, we explicitly construct an H(k, n)-universal graph Γ (k, n) with O(n(log n)) edges. This is optimal up to a small polylogarithmic factor,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2008
ISSN: 1571-0661
DOI: 10.1016/j.entcs.2008.03.036